A Winning Strategy for the Ramsey Graph Game
نویسنده
چکیده
We consider a \Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games.
منابع مشابه
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed target graph H, keeping the constructed graph in a prescribed class G. The main problem is to recognize the wi...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملAn Exact Ramsey Principle for Block Sequences
We prove an exact, i.e., formulated without ∆-expansions, Ramsey principle for infinite block sequences in vector spaces over countable fields where the two sides of the dichotomic principle are represented by respectively winning strategies in Gowers’ block sequence game and winning strategies in the infinite asymptotic game. This allows us to recover Gowers’ dichotomy theorem for block sequen...
متن کاملMinimum degree games for graphs
Given δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate, each adding a new edge in turn, until the resulting graph has minimum degree at least δ. In the achievement game, the last player to move is the winner; in the avoidance game, the last to play is the loser. We determine a winning strategy for the avoidance game for every δ and n. The achievement game i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 5 شماره
صفحات -
تاریخ انتشار 1996